A local smoothing estimate in higher dimensions
نویسندگان
چکیده
منابع مشابه
A local smoothing estimate in higher dimensions
Let N be a large parameter, C a constant, and let ΓN (C) denote the C-neighborhood of the cone segment {ξ : 2−CN ≤ |ξ| ≤ 2N}. For fixed N , we take a partition of unity subordinate to a covering of Sd−1 by caps Θ of diameter about N− 1 2 , and use this to form a (smooth) partition of unity yΘ on ΓN(C) in the natural way. We will write ΓN,Θ(C) = supp yΘ. Let ΞΘ be a function whose Fourier transf...
متن کاملLocal Scale Controlled Anisotropic Di usion with Local Noise Estimate for Image Smoothing and Edge Detection
A novel local scale controlled piecewise linear diffusion for selective smoothing and edge detection is presented. The di usion stops at the place and time determined by the minimum reliable local scale and a spatial variant, anisotropic local noise estimate. It shows nisotropic, nonlinear di usion equation using di usion coe cients/tensors that continuously depend on the gradient is not necess...
متن کاملLocal Scale Controlled Anisotropic Diffusion with Local Noise Estimate for Image Smoothing and Edge Detection
A novel local scale controlled piecewise linear di usion for selective smoothing and edge detection is presented. The di usion stops at the place and time determined by the minimum reliable local scale and a spatial variant, anisotropic local noise estimate. It shows nisotropic, nonlinear di usion equation using di usion coe cients/tensors that continuously depend on the gradient is not necessa...
متن کاملGenerating Surface Geometry in Higher Dimensions using Local Cell Tilers
In two dimensions contour elements surround two dimensional objects, in three dimensions surfaces surround three dimensional objects and in four dimensions hypersurfaces surround hyperobjects. These surfaces can be represented by a collection of connected simplices, hence, continuous n dimensional surfaces can be represented by a lattice of connected n 1 dimensional simplices. The lattice of co...
متن کاملRobust smoothing of gridded data in one and higher dimensions with missing values
A fully automated smoothing procedure for uniformly-sampled datasets is described. The algorithm, based on a penalized least squares method, allows fast smoothing of data in one and higher dimensions by means of the discrete cosine transform. Automatic choice of the amount of smoothing is carried out by minimizing the generalized cross-validation score. An iteratively weighted robust version of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal d'Analyse Mathématique
سال: 2002
ISSN: 0021-7670,1565-8538
DOI: 10.1007/bf02786576